//输入一个矩阵，按照从外向里以顺时针的顺序依次打印出每一个数字。 
//
// 
//
// 示例 1： 
//
// 输入：matrix = [[1,2,3],[4,5,6],[7,8,9]]
//输出：[1,2,3,6,9,8,7,4,5]
// 
//
// 示例 2： 
//
// 输入：matrix = [[1,2,3,4],[5,6,7,8],[9,10,11,12]]
//输出：[1,2,3,4,8,12,11,10,9,5,6,7]
// 
//
// 
//
// 限制： 
//
// 
// 0 <= matrix.length <= 100 
// 0 <= matrix[i].length <= 100 
// 
//
// 注意：本题与主站 54 题相同：https://leetcode-cn.com/problems/spiral-matrix/ 
// Related Topics 数组 
// 👍 126 👎 0

package leetcode.editor.cn;

import common.util.MyUtil;

/**
 * Java：顺时针打印矩阵
 *
 * @author changgui
 */
@SuppressWarnings("all")
public class P剑指_offer_29_ShunShiZhenDaYinJuZhenLcof {
    public static void main(String[] args) {
        Solution solution = new P剑指_offer_29_ShunShiZhenDaYinJuZhenLcof().new Solution();
        int[][] matrix = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};
        MyUtil.printInt(solution.spiralOrder(matrix));
    }

    //leetcode submit region begin(Prohibit modification and deletion)
    class Solution {
        public int[] spiralOrder(int[][] matrix) {
            if (matrix.length == 0) {
                return new int[0];
            }
            int l = 0, r = matrix[0].length - 1, t = 0, b = matrix.length - 1, index = 0;
            int[] nums = new int[(r + 1) * (b + 1)];
            while (true) {
                for (int i = l; i <= r; i++) {
                    nums[index++] = matrix[t][i];
                }
                if (++t > b) {
                    break;
                }
                for (int i = t; i <= b; i++) {
                    nums[index++] = matrix[i][r];
                }
                if (l > --r) {
                    break;
                }
                for (int i = r; i >= l; i--) {
                    nums[index++] = matrix[b][i];
                }
                if (t > --b) {
                    break;
                }
                for (int i = b; i >= t; i--) {
                    nums[index++] = matrix[i][l];
                }
                if (++l > r) {
                    break;
                }
            }
            return nums;

        }
    }
    //leetcode submit region end(Prohibit modification and deletion)

}